منابع مشابه
Deciding Full Branching Time Logic by Program Transformation
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗) properties of finite state reactive systems. The finite state systems and the CTL∗ properties we want to verify, are encoded as logic programs on infinite lists. Our verification method consists of two steps. In the first step we transform the logic program that encodes the given system and th...
متن کاملDeciding branching time properties for asynchronous programs
Asynchronous programming is a paradigm that supports asynchronous function calls in addition to synchronous function calls. Programs in such a setting can be modeled by automata with counters that keep track of the number of pending asynchronous calls for each function as well as a call stack for synchronous recursive computation. These programs have the restriction that an asynchronous call is...
متن کاملLinear Time Datalog and Branching Time Logic
We survey recent results about the relation between Datalog and temporal veriication logics. Datalog is a well-known database query language relying on the logic programming paradigm. We introduce Dat-alog LITE, a fragment of Datalog with well-founded negation, which has an easy stratiied semantics and a linear time model checking algorithm. Datalog LITE subsumes temporal languages such as CTL ...
متن کاملLinear Time Datalog for Branching Time Logic
In this paper we show that Datalog is well-suited as a temporal veriication language. Dat-alog is a well-known database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with well-founded negation, and present a linear time model checking algorithm for Datalog LITE. We show that Datalog LITE subsumes temporal languages such as CTL and the...
متن کاملTableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of branching time
We develop a sound and complete tableau-based decision procedure for the full coalitional multiagent temporalepistemic logic of branching time CMATEL(CD+BT) that extends logic CTL with epistemic operators for common and distributed knowledge for all coalitions of agents referred to in the language. The procedure runs in exponential time, which matches the lower bound established by Halpern and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1984
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80047-9